Avoiding Root-Finding in the Krusell-Smith Algorithm Simulation
نویسندگان
چکیده
منابع مشابه
Recursive Equilibrium in Krusell and Smith (1998)∗
I combine the tools developed in two important and independent literatures one on large economies started with Aumann (1964) and the other on dynamically incomplete markets, notably Duffie et al. (1994) to study Krusell and Smith’s incomplete markets economy with both idiosyncratic and aggregate shocks. I show the existence of generalized recursive equilibrium and characterize several important...
متن کاملSolving the incomplete markets model with aggregate uncertainty using the Krusell–Smith algorithm and non-stochastic simulations
This article describes the approach to computing the version of the stochastic growth model with idiosyncratic and aggregate risk that relies on collapsing the aggregate state space down to a small number of moments used to forecast future prices. One innovation relative to most of the literature is the use of a non-stochastic simulation routine. & 2009 Elsevier B.V. All rights reserved.
متن کاملA new root-based direction-finding algorithm
[1] Polynomial rooting direction-finding (DF) algorithms are a computationally efficient alternative to search-based DF algorithms and are particularly suitable for uniform linear arrays of physically identical elements provided that mutual interaction among the array elements can be either neglected or compensated for. A popular algorithm in such situations is Root Multiple Signal Classificati...
متن کاملMcmullen’s Root-finding Algorithm for Cubic Polynomials
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2020
ISSN: 1556-5068
DOI: 10.2139/ssrn.3714593